Twig Pattern Minimization Based on XML Schema Constraints

نویسندگان

  • Yuan Gao
  • Husheng Liao
  • Hongyu Gao
چکیده

6608 | P a g e J a n u a r y 1 9 , 2 0 1 6 Twig Pattern Minimization Based on XML Schema Constraints Yuan Gao, Husheng Liao, Hongyu Gao Beijing University if technology, China , Beijing,Chaoyang district 100124 [email protected] Beijing University if technology, China , Beijing,Chaoyang district 100124 [email protected] Beijing University if technology, China , Beijing,Chaoyang district 100124 [email protected] ABSTRACT Twig pattern is one of the core components of XQuery. Twig usually includes redundancy nodes which can be optimized. Schema feature is used to judge whether the node of Twig pattern is redundancy. In this paper, we propose sufficient Schema constraints and specific rules. We have designed more determination conditions to optimize, then we will get the most efficient results. By a large number of test case, we finally get the practical limits of minimization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Answering XML Twig Queries with Automata

XML is emerging as a de facto standard for information representation and data exchange over the web. Evaluation of twig queries, which allows users to find all occurrence of a multiple branch pattern in an XML database, is a core and complicate operation for XML query processing. Performance of conventional evaluation approaches based on structural join declines with the expansion of data size...

متن کامل

Efficient Processing of Partially Specified Twig Queries

XML has been used extensively in many applications as a de facto standard for information representation and exchange over the internet. Huge volumes of data are organized or exported in treestructured form and the desired information can be got by traversing the whole tree structure using a twig query or keyword based query. Although twig query can express more semantic information, it is infe...

متن کامل

Prefix Path Streaming: a New Clustering Method for XML Twig Pattern Matching

Searching for all occurrences of a twig pattern in a XML document is an important operation in XML query processing. Recently a class of holistic twig pattern matching algorithms has been proposed. Compared with the prior approaches, the holistic method avoids generating large intermediate results which do not contribute to the final answer. The method is CPU and I/O optimal when twig patterns ...

متن کامل

A Hybrid Approach for General XML Query Processing

The state-of-the-art XML twig pattern query processing algorithms focus on matching a single twig pattern to a document. However, many practical queries are modeled by multiple twig patterns with joins to link them. The output of twig pattern matching is tuples of labels, while the joins between twig patterns are based on values. The inefficiency of integrating label-based structural joins in t...

متن کامل

A Complete Search Engine for Efficient and Data Integration Using Fuzzy Search

As the next generation of the Web language, XML is straightforwardly usable, which has been the de-facto standard of information representation and exchange over the Web. XML employs a tree-structured data model, and XML queries specify patterns of selection predicates on multiple elements related by a tree structure. Due to increase in web-based applications, searching for all occurrences of a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016